dp = [0]
n, d = map(int, input().split())
s = input()
for i in range(1, len(s)):
if s[i] == '0':
dp.append(10 ** 10)
else:
mn = 10 ** 10
for j in range(max(0, i - d), i):
mn = min(mn, dp[j])
if mn == 10 ** 10:
dp.append(10 ** 10)
else:
dp.append(mn + 1)
abc = 1
if dp[-1] == 10 ** 10:
print(-1)
else:
print(dp[-1])
#include<bits/stdc++.h>
using namespace std;
bool dfs(string &save, int start, int dis, int m){
//cout<<start<<'\n';
if(start >= save.size() - 1){
if(start == save.size() - 1){
// cout<<start<<' '<<dis<<'\n';
cout<<dis;
return true;
}
else if(start >= save.size()) return false;
}
else{
if(save[start] == '0') return false;
for(int i = m; i >= 1; i--){
if(dfs(save, start + i, dis + 1, m)) return true;
}
}
return false;
}
int main(){
int n, m;
cin>>n>>m;
string save;
cin>>save;
int c = 0;
for(int i = 0; i < save.size(); i++){
if(c == m){
cout<<-1;
return 0;
}
if(save[i] == '1') c = 0;
else c++;
}
if(!dfs(save, 0, 0, m)) cout<<-1;
} 1302. Deepest Leaves Sum | 1209. Remove All Adjacent Duplicates in String II |
994. Rotting Oranges | 983. Minimum Cost For Tickets |
973. K Closest Points to Origin | 969. Pancake Sorting |
967. Numbers With Same Consecutive Differences | 957. Prison Cells After N Days |
946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |